Some Bounds and a Construction for Secure Broadcast Encryption
نویسندگان
چکیده
We rst present two tight lower bounds on the size of the secret keys of each user in an unconditionally secure one-time use broadcast encryption scheme (OTBES). Then we show how to construct a computa-tionally secure multiple-use broadcast encryption scheme (MBES) from a key predistribution scheme (KPS) by using the ElGamal cryptosystem. We prove that our MBES is secure against chosen (message, privileged subset of users) attacks if the ElGamal cryptosystem is secure and if the original KPS is simulatable. This is the rst MBES whose security is proved formally.
منابع مشابه
Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness
Data stored in cloud storage sometimes requires long-term security due to its sensitivity (e.g.,genome data), and therefore, it also requires flexible access control for handling entities who canuse the data. Broadcast encryption can partially provide such flexibility by specifying privilegedreceivers so that only they can decrypt a ciphertext. However, once privileged receivers...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملAn Optimal Subset Cover for Broadcast Encryption
In broadcast networks, it is often required to encrypt data so that only a privileged set of users with access to the session key can access the data. The standard technique of transferring the session key to each user individually does not scale with the number of users typically found on a network such as cable. This method is not only time-wise inefficient, but also incurs high communication...
متن کاملForward-Secure Identity-based Broadcast Encryption Scheme from Lattice
Motivated by an identity-based broadcast encryption scheme from lattice[1] and a forward-secure identity-based encryption scheme[2], we propose a forward-secure identity-based broadcast encryption scheme from lattice by adding the forward-security mechanism on broadcast encryption scheme. Our scheme satisfies the security requirements of both the broadcast encryption scheme and forward-security...
متن کاملTrade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution
In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish a common key. This scheme made use of a key predistribution scheme due to Blom. In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998